Autonomous mobile robots with lights

نویسندگان

  • Shantanu Das
  • Paola Flocchini
  • Giuseppe Prencipe
  • Nicola Santoro
  • Masafumi Yamashita
چکیده

We consider the well known distributed setting of computational mobile entities, called robots, operating in the Euclidean plane in Look-Compute-Move (LCM) cycles. We investigate the computational impact of expanding the capabilities of the robots by endowing them with an externally visible memory register, called light, whose values, called colors, are persistent, that is they are not automatically reset at the end of each cycle. We refer to so endowed entities as luminous robots. We study the computational power of luminous robots with respect to the three main settings of activation and synchronization: fully-synchronous, semi-synchronous, and asynchronous. We establish several results. A main contribution is the constructive proof that asynchronous robots, illuminated with a constant number of colors, are strictly more powerful than traditional semi-synchronous robots. We also constructively prove that, for luminous robots, the difference between asynchrony and semi-synchrony disappears. This result must be contrasted with the strict dominance between the models without lights (even if the robots are enhanced with an unbounded amount of persistent internal memory). Additionally we show that there are problems that robots cannot solve without lights, even if they are fully-synchronous, but can be solved by asynchronous luminous robots with O(1) colors. It is still open whether or not asynchronous luminous robots with O(1) colors are more powerful than fully-synchronous robots without lights. We prove that this is indeed the case if the robots have the additional capability of remembering a single snapshot. This in turn shows that, for asynchronous robots, to have O(1) colors and a single snapshot renders them more powerful than to have an unlimited amount of persistent memory (including snapshots) but no lights. ∗Some of these results have been presented at the 32nd International Conference on Distributed Computing Systems (ICDCS). †LIF, Aix-Marseille University & CNRS, France. Email: [email protected] ‡SEECS, University of Ottawa, Canada. Email: [email protected] §Dipartimento di Informatica, Università di Pisa, Italy. Email: [email protected] ¶School of Computer Science, Carleton University, Canada. Email: [email protected] ‖Department of Informatics, Kyushu University, Japan. Email: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Are Autonomous Mobile Robots Able to Take Over Construction? A Review

Although construction has been known as a highly complex application field for autonomous robotic systems, recent advances in this field offer great hope for using robotic capabilities to develop automated construction. Today, space research agencies seek to build infrastructures without human intervention, and construction companies look to robots with the potential to improve construction qua...

متن کامل

Effective Mechatronic Models and Methods for Implementation an Autonomous Soccer Robot

  Omni directional mobile robots have been popularly employed in several applications especially in soccer player robots considered in Robocup competitions. However, Omni directional navigation system, Omni-vision system and solenoid kicking mechanism in such mobile robots have not ever been combined. This situation brings the idea of a robot with no head direction into existence, a comprehensi...

متن کامل

Optimal Rendezvous ${\mathcal L}$-Algorithms for Asynchronous Mobile Robots with External-Lights

We study the Rendezvous problem for 2 autonomous mobile robots in asynchronous settings with persistent memory called light. It is well known that Rendezvous is impossible in a basic model when robots have no lights, even if the system is semi-synchronous. On the other hand, Rendezvous is possible if robots have lights of various types with a constant number of colors [9, 22]. If robots can obs...

متن کامل

Navigation Techniques of Mobile Robots In Greenhouses

With the continuous development of the industrialization process, the countries all over the world gradually appeared lack of agricultural labor force and aging phenomenon, which was especially prominent in developed countries. However the agricultural robot with high operating efficiency, high qualities of work will play an increasingly important role in future agricultural production. Robot n...

متن کامل

Brief Announcement: Optimal Asynchronous Rendezvous for Mobile Robots with Lights

We study a Rendezvous problem for 2 autonomous mobile robots in asynchronous settings with persistent memory called light. It is well known that Rendezvous is impossible when robots have no lights in basic common models, even if the system is semi-synchronous. On the other hand, Rendezvous is possible if robots have lights with a constant number of colors in several types lights[9, 20]. In asyn...

متن کامل

Navigation Techniques of Mobile Robots In Greenhouses

With the continuous development of the industrialization process, the countries all over the world gradually appeared lack of agricultural labor force and aging phenomenon, which was especially prominent in developed countries. However the agricultural robot with high operating efficiency, high qualities of work will play an increasingly important role in future agricultural production. Robot n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 609  شماره 

صفحات  -

تاریخ انتشار 2016